Point-kernel Method for Radiation Fields Simulation
نویسنده
چکیده
Design and maintenance of nuclear cycle facilities mandatory imply implementation of efficient radiation protection. Radiation environment assessment and shielding optimization require a considerable amount of numerical calculations. Nowadays mathematical modelling methods and corresponding software are widely used for such kind of problems. All the software used for radiation fields modelling falls into two main groups. To the first belongs software based on Monte Carlo methods, such as MCNP [1], Geant [2], Penelope, Fluka, etc. Modern implementations of Monte Carlo method provide consistent accounting of radiation transport effects. This leads to perfect accuracy of the calculated values even for complex models. At the same time Monte Carlo calculations require considerable amount of computing time. Computation burden increases rapidly for complex geometries, multiple sources and thick shielding. Another group contains software implementing analytical methods. The examples of such programs are Microshield, QAD, Mercure. All this programs use point-kernel method for doze calculations. This method is much more less computationally intensive than Monte Carlo method. Series of calculations necessary for shielding optimization could be conducted at reliable time using point-kernel method. But due to macroscopic approach to radiation transport this methods lucks consistency. The main problem pointkernel method encounters is account for scattered radiation which is usually implemented through semiempirical approximation. Additional ”build-up” factor must be introduced as a multiplier to the attenuated doze. Determination of the appropriate buildup factor can be rather complex as it depends upon the energy, the thickness and type of material. Uncertainties in determining build-up factor essentially limit the accuracy of point-kernel method. In our paper we considered some aspects of pointkernel method and its implementation by Mercure-3 program code [4]. Results of doze calculations for some typical cases are presented. Also point-kernel method verification by the MCNP code [1] is discussed.
منابع مشابه
An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملEnsemble Kernel Learning Model for Prediction of Time Series Based on the Support Vector Regression and Meta Heuristic Search
In this paper, a method for predicting time series is presented. Time series prediction is a process which predicted future system values based on information obtained from past and present data points. Time series prediction models are widely used in various fields of engineering, economics, etc. The main purpose of using different models for time series prediction is to make the forecast with...
متن کاملCalculations of Linac Photon Dose Distributions in Homogeneous Phantom Using Spline
Introduction Relative dose computation is a necessary step in radiation treatment planning. Therefore, finding an approach that is both fast and accurate seems to be necessary. The purpose of this work was to investigate the feasibility of natural cubic spline to reconstruct dose maps for linear accelerator radiation treatment fields in comparison with those of the simulation. Materials and Met...
متن کاملAn Effective Numerical Technique for Solving Second Order Linear Two-Point Boundary Value Problems with Deviating Argument
Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...
متن کاملInterval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets
This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...
متن کامل